Effective Application of Grasp
نویسندگان
چکیده
A greedy randomized adaptive search procedure (GRASP) is an iterative multistart metaheuristic for difficult combinatorial optimization. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing. In this paper, we cover the literature where GRASP is applied to scheduling, routing, logic, partitioning, location, graph theory, assignment, manufacturing, transportation, telecommunications, biology and related fields, automatic drawing, power systems, and VLSI design.
منابع مشابه
The Effects of Grasp Conditions on Maximal Acceptable Combined Forces (pushing and pinch forces) for Manual Insertion of Snap Fasteners
The objective of this study was to determine the effects of grasp conditions (types of grasp, grasp width, glove and types of coupling) on maximal pushing force (MPF) and required pinch force (RPF) during snap fit assembly. The results indicated that the type of grasp, the type of coupling and wearing gloves have significant (p
متن کاملGRASP — A New Search Algorithm for Satisfiability João
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniques and facilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the augmentation of basic backtracking sear...
متن کاملInterface to grasp misunderstandings for teachers in
In this paper, we discuss the interface of elearning systems that make teachers to grasp students’ misunderstandings quickly in quizzes. Teachers need to grasp students’ misunderstandings to make their lectures effective. One of effective method for it is a quiz, which means a simple paper test. Though it is effective, it is troublesome for teachers to distribute answer sheet, collect them, rea...
متن کاملConflict Analysis in Search Algorithms for Satisfiability
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Prop-ositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques, some of which are specific to SAT, whereas others find equivalent in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during search and its most dis...
متن کاملConflict Analysis in Search Algorithms for Satisfiability - Tools with Artificial Intelligence, 1996., Proceedings Eighth IEEE International Conference on
This paper introduces GRASP (Generic seaRch Algorithm for the Sati$ability Problem), a new search algorithm f o r Propositional Satisjability (SAT). GRASP incorporates several search-pruning techniques, some of which are spec$c to SAT whereas others f ind equivalent in other f i e h ofArt$cial Intelligence. GRASP is premised on the inevitability of conflicts during search and its most distingui...
متن کامل